On Constructing 1-1 One-Way Functions
نویسندگان
چکیده
We show how to construct length-preserving 1-1 one-way functions based on popular intractability assumptions (e.g., RSA, DLP). Such 1-1 functions should not be confused with (infinite) families of (finite) one-way permutations. What we want and obtain is a single (infinite) 1-1 one-way function.
منابع مشابه
On the Complexity of Parallel Hardness Amplification for One-Way Functions
We prove complexity lower bounds for the tasks of hardness amplification of one-way functions and construction of pseudo-random generators from one-way functions, which are realized non-adaptively in black-box ways. First, we consider the task of converting a one-way function f : {0, 1} → {0, 1} into a harder one-way function f̄ : {0, 1} → {0, 1}, with n̄, m̄ ≤ poly(n), in a black-box way. The har...
متن کاملOn Hardness Amplification of One-Way Functions
We continue the study of the efficiency of black-box reductions in cryptography. We focus on the question of constructing strong one-way functions (respectively, permutations) from weak one-way functions (respectively, permutations). To make our impossibility results stronger, we focus on the weakest type of constructions: those that start from a weak one-way permutation and define a strong one...
متن کاملDomain Extension for Enhanced Target Collision-Resistant Hash Functions
We answer the question of Reyhanitabar et al. from FSE’09 of constructing a domain extension scheme for enhanced target collisionresistant (eTCR) hash functions with sublinear key expansion. The eTCR property, introduced by Halevi and Krawczyk [1], is a natural fit for hashand-sign signature schemes, offering an attractive alternative to collisionresistant hash functions. We prove a new composi...
متن کاملIntroduction to Cryptography November 2 , 2006 Lecture 20 : Digital Signatures II
In the last lecture, we developed a digital signature scheme for message in {0, 1} n and proved it to be one-time secure. We also showed how to construct a family of Collision-Resistant Hash Functions (CRH) and claimed that they would be useful in constructing one-time secure digital signature schemes for messages in {0, 1} *. The following theorem makes this claim more formally. Theorem 1 If t...
متن کاملConnections among Several Versions of One-way Hash Functions 1
We study the following two kinds of one-way hash functions: universal one-way hash functions (UOHs) and collision intractable hash functions (CIHs). The main property of the former is that given an initial-string x, it is computationally diicult to nd a diierent string y that collides with x. And the main property of the latter is that it is computationally diicult to nd a pair x 6 = y of strin...
متن کامل